Figaro: Yet Another Constraint Programming Library
نویسندگان
چکیده
منابع مشابه
Figaro: Yet Another Constraint Programming Library
Existing libraries and languages for nite domain constraint programming usually have depth-rst search (with branch and bound) built-in as the only search algorithm. Exceptions are the languages claire and Oz, which support the programming of diierent search algorithms through special purpose programming language constructs. The goal of this work is to make abstractions for programming search al...
متن کاملYalAA: Yet Another Library for Affine Arithmetic
In this paper, we present YalAA, a new library for affine arithmetic. Recently, affine arithmetic has been given increased attention even from outside the traditional verified computing community, for example, in the areas of circuit design, GPU based rendering of implicit objects and global optimization. Furthermore, several improvements to the original affine model were proposed. However, a f...
متن کاملYet Another Java Based Discrete-Event Simulation Library
JAPROSIM is a well designed library, free and open source that adopts the popular process-interaction worldview. It is implemented in Java programming language allowing deep access to its powerful features and can serve as a basis for the development of dedicated objectoriented simulation environments. The paper presents architecture and major components of the library. The process-interaction ...
متن کاملPractical Probabilistic Programming with Figaro
Figaro is an object–oriented, functional probabilistic programming language (PPL). As an embedded library within Scala, Figaro is a flexible, modular, and powerful PPL that enables users to construct a wide variety of rich, complex, and relational models in a general purpose programming language. Coupled with diverse suite of built-in inference algorithms, Figaro provides the tools needed for u...
متن کاملYet Another Local Search Method for Constraint Solving
We propose a generic, domain-independent local search method called adaptive search for solving Constraint Satisfaction Problems (CSP). We design a new heuristics that takes advantage of the structure of the problem in terms of constraints and variables and can guide the search more precisely than a global cost function to optimize (such as for instance the number of violated constraints). We a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Notes in Theoretical Computer Science
سال: 2000
ISSN: 1571-0661
DOI: 10.1016/s1571-0661(05)80107-0